Approximation for Minimum Triangulations of Simplicial Convex 3-Polytopes
نویسندگان
چکیده
منابع مشابه
Minimal Simplicial Dissections and Triangulations of Convex 3-Polytopes
This paper addresses three questions related to minimal triangulations of a three-dimensional convex polytope P. • Can the minimal number of tetrahedra in a triangulation be decreased if one allows the use of interior points of P as vertices? • Can a dissection of P use fewer tetrahedra than a triangulation? • Does the size of a minimal triangulation depend on the geometric realization of P? Th...
متن کاملTriangulations of Simplicial Polytopes
Various facts about triangulations of simplicial polytopes, particularly those pertaining to the equality case in the generalized lower bound conjecture, are collected together here. They include an apparently weaker restriction on the kind of triangulation which needs to be found, and an inductive argument which reduces the number of cases to be established.
متن کاملEnumerating Triangulations of Convex Polytopes
A triangulation of a finite point set A in IRd is a geometric simplicial complex which covers the convex hull of A and whose vertices are points of A. We study the graph of triangulations whose vertices represent the triangulations and whose edges represent geometric bistellar flips. The main result of this paper is that the graph of triangulations in three dimensions is connected when the poin...
متن کاملThe complexity of finding small triangulations of convex 3-polytopes
The problem of finding a triangulation of a convex three-dimensional polytope with few tetrahedra is NP -hard. We discuss other related complexity results.
متن کاملMinimal Simplicial Dissections and Triangulations of Convex
This paper addresses three questions related to minimal triangulations of a 3-dimensional convex polytope P . • Can the minimal number of tetrahedra in a triangulation be decreased if one allows the use of interior points of P as vertices? • Can a dissection of P use fewer tetrahedra than a triangulation? • Does the size of a minimal triangulation depend on the concrete realization of P ? The m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2001
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-001-0045-8